Neural marching cubes
نویسندگان
چکیده
We introduce Neural Marching Cubes , a data-driven approach for extracting triangle mesh from discretized implicit field. base our meshing on (MC), due to the simplicity of its input, namely uniform grid signed distances or occupancies, which frequently arise in surface reconstruction and neural models. However, classical MC is defined by coarse tessellation templates isolated individual cubes. While more refined tessellations have been proposed several variants, they all make heuristic assumptions, such as trilinearity, when determining vertex positions local topologies each cube. In principle, none these approaches can reconstruct geometric features that reveal coherence dependencies between nearby cubes (e.g., sharp edge ), information unaccounted for, resulting poor estimates true underlying To tackle challenges, we re-cast deep learning perspective, designing apt at preserving features, training meshes, account contextual develop compact per-cube parameterization represent output mesh, while being compatible with processing, so simple 3D convolutional network be employed training. show topological cases cube are applicable design easily derived using representation, also obtained naturally efficiently following few guidelines. addition, learns limited receptive fields, hence it generalizes well new shapes datasets. evaluate quantitative qualitative comparisons well-known variants. particular, demonstrate ability recover edges corners, long-standing issue Our reconstructs accurately than previous approaches. Code data available https://github.com/czq142857/NMC.
منابع مشابه
On Marching Cubes
A characterization and classification of the isosurfaces of trilinear functions is presented. Based upon these results, a new algorithm for computing a triangular mesh approximation to isosurfaces for data given on a 3D rectilinear grid is presented. The original marching cubes algorithm is based upon linear interpolation along edges of the voxels. The asymptotic decider method is based upon bi...
متن کامل(No) More Marching Cubes
Isosurfaces, one of the most fundamental volumetric visualization tools, are commonly rendered using the wellknown Marching Cubes cases that approximate contours of trilinearly-interpolated scalar fields. While a complete set of cases has recently been published by Nielson, the formal proof that these cases are the only ones possible and that they are topologically correct is difficult to follo...
متن کاملProbabilistic Marching Cubes
In this paper we revisit the computation and visualization of equivalents to isocontours in uncertain scalar fields. We model uncertainty by discrete random fields and, in contrast to previous methods, also take arbitrary spatial correlations into account. Starting with joint distributions of the random variables associated to the sample locations, we compute level crossing probabilities for ce...
متن کاملAdaptive Extended Marching Cubes
The demands related to Volumetric Models are increasing rapidly due to the availability of 3D scanner, but its application in the manipulation of volumetric data raises several issues that need to be addressed. The fundamental of manipulating volumetric data includes isosurface extraction, while sharp features of 3D models are well preserved with Extended Marching Cubes algorithm (EMC). However...
متن کاملMarching cubes: surface complexity measure
In this work we give an approach to analyse a surface topology complexity inside a cube in the Marching Cube (MC) algorithm. The number of the isosurface intersections with the cube diagonals is used as the complexity criterion. In the case of the trilinear interpolation we have the cubic equation on the each cube diagonal and there is a possibility to find the coordinates of the three intersec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2021
ISSN: ['0730-0301', '1557-7368']
DOI: https://doi.org/10.1145/3478513.3480518